Simple Truth Invariant Cad's and Solution Formula Construction

نویسندگان

  • Christopher W. Brown
  • George E. Collins
چکیده

Given a prenex formula F of elementary real algebra having k free variables, the CAD method of quantiier elimination produces a truth invariant CAD, D, for F, that is, a CAD of k-dimensional real space in each cell of which F is truth-invariant, together with an assignment to each cell of its truth value. The method also produces a set P of irreducible projection polynomials, the real zeros of which form the boundaries of the cells. Typically there exists a coarser truth-invariant CAD, D 0 , for F and a subset, P 0 , of P whose real zeros form the boundaries of D 0. We describe an eecient method for deriving such a D 0 and P 0 from D and P. The original set P may not suuce for construction of a solution formula (a quantiier-free formula equivalent to F), but P 0 will suuce if P does. We describe a method for augmenting P 0 in this case to a larger set that suuces. In either case the task of solution formula construction is much reduced by the smaller size of P 0 .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple CAD Construction and its Applications

The method of quantifier elimination by cylindrical algebraic decomposition (CAD) takes a formula from the elementary theory of real closed fields as input, and constructs a CAD of the space of unquantified variables. This decomposition is truth invariant with respect to the input formula, meaning that the formula is either identically true or identically false in each cell of the decomposition...

متن کامل

Resolving Gödel's Incompleteness Myth: Polynomial Equations and Dynamical Systems for Algebraic Logic

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Gödel’s incompleteness theorems. The truth value of a logical formula subject to a set of axioms is computed from the solution to the corresponding system of polynomial equations. A reference by a formula to its own provability is shown to be a recurrence...

متن کامل

SOLUTION-SET INVARIANT MATRICES AND VECTORS IN FUZZY RELATION INEQUALITIES BASED ON MAX-AGGREGATION FUNCTION COMPOSITION

Fuzzy relation inequalities based on max-F composition are discussed, where F is a binary aggregation on [0,1]. For a fixed fuzzy relation inequalities system $ A circ^{F}textbf{x}leqtextbf{b}$, we characterize all matrices $ A^{'} $ For which the solution set of the system $ A^{' } circ^{F}textbf{x}leqtextbf{b}$ is the same as the original solution set. Similarly, for a fixed matrix $ A $, the...

متن کامل

Tft Construction of Rcft Correlators Iii: Simple Currents

We use simple currents to construct symmetric special Frobenius algebras in modular tensor categories. We classify such simple current type algebras with the help of abelian group cohomology. We show that they lead to the modular invariant torus partition functions that have been studied by Kreuzer and Schellekens. We also classify boundary conditions in the associated conformal field theories ...

متن کامل

Syntactic Characterization of Propositional Satisfiability

The subject of the research reported in this thesis belongs to the area known as Propositional Satisfiability, an area located in the intersection of Theoretical Computer Science, Artificial Intelligence, and Mathematical Logic. In this thesis I show that the set of satisfying truth-value assignments of a satisfiable propositional formula can be constructed from the syntactic structure of the f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996